The Borsuk-Ulam Theorem and Bisection of Necklaces

نویسندگان
چکیده

منابع مشابه

The Borsuk-Ulam Theorem and Bisection of Necklaces

The Borsuk-Ulam theorem of topology is applied to a problem in discrete mathematics. A bisection of a necklace with k colors of beads is a collection of intervals whose union captures half the beads of each color. Every necklace with fc colors has a bisection formed by at most k cuts. Higherdimensional generalizations are considered.

متن کامل

The Borsuk-Ulam Theorem

I give a proof of the Borsuk-Ulam Theorem which I claim is a simplified version of the proof given in Bredon [1], using chain complexes explicitly rather than homology. Of course this is a matter of taste, and the mathematical content is identical, but in my opinion this proof highlights precisely where and how the contradiction arises. 1 Statements and Preliminaries Theorem 1.1 (Borsuk-Ulam). ...

متن کامل

Digital Borsuk-Ulam theorem

The aim of this paper is to compute a simplicial cohomology group of some specific digital images. Then we define ringand algebra structures of a digital cohomology with the cup product. Finally, we prove a special case of the Borsuk-Ulam theorem fordigital images.

متن کامل

The Borsuk-Ulam Theorem

For simplicity, we adopt the following rules: a, b, x, y, z, X, Y , Z denote sets, n denotes a natural number, i denotes an integer, r, r1, r2, r3, s denote real numbers, c, c1, c2 denote complex numbers, and p denotes a point of En T. Let us observe that every element of IQ is irrational. Next we state a number of propositions: (1) If 0 ≤ r and 0 ≤ s and r2 = s2, then r = s. (2) If frac r ≥ fr...

متن کامل

Splitting Necklaces and a Generalization of the Borsuk-ulam Antipodal Theorem

We prove a very natural generalization of the Borsuk-Ulam antipodal Theorem and deduce from it, in a very straightforward way, the celebrated result of Alon [1] on splitting necklaces. Alon’s result says that t(k− 1) is an upper bound on the number of cutpoints of an opened t-coloured necklace so that the segments we get can be used to partition the set of vertices of the necklace into k subset...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1986

ISSN: 0002-9939

DOI: 10.2307/2045739